RBF: A New Storage Structure for Space-Efficient Queries for Multidimensional Metadata in OSS
نویسندگان
چکیده
Object-based storage systems (OSS) have evolved from the traditionally unintelligent management to intelligent and selfmanaged schemes by delegating low-level management activities to storage devices, and providing new functionalities, such as greater scalability and dynamic reconfiguration. An object consists of data, user-accessible attributes and device-managed metadata, which is responsible for mapping data structures, such as files and directories, to blocks on storage devices. Such metadata usually contains multidimensional information for representing the mapping relationship with objects that have both physical and logical attributes, such as access time, data size, request amount, access pattern, and QoS agreement. Thus, substantial storage space has to be used to store multidimensional metadata, along with highly complicated operations of querying multidimensional metadata, due to complex data organization structures. Common query operations, mainly including point query and range query that are independent of the underlying data layout, allow one to search objects that have multidimensional attributes, with the help of multidimensional metadata. • Point query determines whether a given object is a member of a data set. For example, a request of point query for multidimensional metadata may wish to know whether an object with “ID=xyz” and “data size=100GB” attributes is a member of the current storage system. • Range query obtains all objects whose attribute values exist within the ranges of a query request. For example, a request of range query for multidimensional metadata may wish to know all the objects having “data size>150GB” and “access time<20:00” attributes.
منابع مشابه
ارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملبهبود الگوریتم انتخاب دید در پایگاه داده تحلیلی با استفاده از یافتن پرس وجوهای پرتکرار
A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...
متن کاملWarehousing and Studying Open Source Versioning Metadata
In this paper, we describe the downloading and warehousing of Open Source Software (OSS) versioning metadata from SourceForge, BerliOS Developer, and GNU Savannah. This data enables and supports research in areas such as software engineering, open source phenomena, social network analysis, data mining, and project management. This newly-formed database containing Concurrent Versions System (CVS...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007